Declarative coordination of graph-based parallel programs
نویسندگان
چکیده
منابع مشابه
Developing Parallel Programs in a Graph-Based Environment
Explicit parallel programming requires changing from a single linear flow of control to complicated, non-linear systems of parallel processes related via complex interdependencies. We argue that traditional, text-based parallel programming languages are not the best choice for describing parallel systems. Almost all interesting aspects of parallel systems are hidden in the linear textual descri...
متن کاملGraph-based software construction for parallel message-passing programs
A programming language which supports the adequate speciication of both { the parallel and sequential { aspects of a program establishes the optimal basis for a parallel programming methodology. Parallel languages which are entirely based on textual representations are not the best choice for describing parallelism. The main drawbacks stem from the fact that the sequential order of textual repr...
متن کاملA Declarative Approach to Graph Based Modeling
The class of TGraphs, i.e. typed, attributed, and ordered directed graphs, is introduced as a general graph class for graph based mode-ling. TGraphs are suitable for a wide area of applications. A declarative approach to specifying subclasses of TGraphs by a combination of a schematic graphical description and an additional constraint language is given. The implementation of TGraphs by an appro...
متن کاملDeclarative Data-Driven Coordination
The vision of declarative-data driven coordination (D3C) [3] enables users to communicate and coordinate through declarative specifications. A declarative query mechanism for D3C, named entangled queries, has been presented in [2]. Raising this notion to the level of transactions introduces many new challenges, such as a formal characterization of additional anomalies [6] or a choice of a concu...
متن کاملAnalysis and Optimization of Explicitly Parallel Programs Using the Parallel Program Graph Representation Analysis and Optimization of Explicitly Parallel Programs Using the Parallel Program Graph Representation
As more and more programs are written in explicitly parallel programming languages , it becomes essential to extend the scope of sequential analysis and optimization techniques to explicitly parallel programs. Since the deenition of a program dependence graph (PDG) is strongly tied to its underlying sequential program, the PDG is an inadequate intermediate representation for analysis and optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2016
ISSN: 0362-1340,1558-1160
DOI: 10.1145/3016078.2851153